-
1 mathematical heuristics
Большой англо-русский и русско-английский словарь > mathematical heuristics
-
2 mathematical heuristics
Математика: математическая эвристикаУниверсальный англо-русский словарь > mathematical heuristics
-
3 mathematical heuristics
English-Russian scientific dictionary > mathematical heuristics
-
4 mathematical heuristics
Англо-русский словарь по исследованиям и ноу-хау > mathematical heuristics
-
5 heuristics
-
6 Heuristics
[A]t one point AM [Automatic Mathematician] had some notions of sets, set-operations, numbers, and simple arithmetic. One heuristic rule it knew said " If F is an interesting relation, then look at its inverse". This rule fired after AM had studied "multiplication" for a while. The r.h.s. of the rule then directed AM to define and study the relation "divisors-of" (e.g. divisors-of (12) {1,2,3,4,6,12}. Another heuristic rule that later fired said " If f is a relation from A into B, then it's worth examining those members of A which map into extremal members of B." In this case, f was matched to "divisors-of", A was "numbers", B was "sets of numbers", and an extremal member of B might be, e.g., a very small set of numbers. Thus this heuristic rule caused AM to define the set of numbers with no divisors, the set of numbers with only 1 divisor, with only 2 divisors, etc. One of these sets (the last [ sic] mentioned) turned out subsequently to be quite important; these numbers are of course the primes. (Lenat & Harris, 1978, p. 30)Extraordinarily rapid progress during the early stages of an attack on a new problem area is a rather common occurrence in AI research; it merely signifies that the test cases with which the system has been challenged are below the level of difficulty where combinatorial explosion of the number of pathways in the problem space sets in.... It is the goal of AI research to move that threshold higher and higher on the scale of problem complexity through the introduction of heuristics-heuristics to reduce the rate of growth of the solution tree, heuristics to guide the development of the tree so that it will be rich in pathways leading to satisfactory problem solutions, and heuristics to direct the search to the "best" of these pathways. (Gelernter, quoted in Barr & Feigenbaum, 1982, pp. 139-140)Historical dictionary of quotations in cognitive science > Heuristics
-
7 математическая эвристика
Русско-английский научно-технический словарь Масловского > математическая эвристика
-
8 математическая эвристика
Большой англо-русский и русско-английский словарь > математическая эвристика
-
9 математическая эвристика
Mathematics: mathematical heuristicsУниверсальный русско-английский словарь > математическая эвристика
См. также в других словарях:
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Mathematical beauty — An example of beauty in method a simple and elegant geometrical proof that the Pythagorean theorem is true for a particular right angled triangle. Many mathematicians derive aesthetic pleasure from their work, and from mathematics in general.… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( … Wikipedia
Quantitative comparative linguistics — is a branch of comparative linguistics that applies mathematical models to the problem of classifying language relatedness. This includes the use of computational phylogenetics and cladistics to define an optimal tree (or network) to represent a… … Wikipedia
Heuristic — (hyu̇ ˈris tik) is a method to help solve a problem, commonly an informal method. It is particularly used to rapidly come to a solution that is reasonably close to the best possible answer, or optimal solution . Heuristics are rules of thumb ,… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Behavioral economics — and its related area of study, behavioral finance, use social, cognitive and emotional factors in understanding the economic decisions of individuals and institutions performing economic functions, including consumers, borrowers and investors,… … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia